全文获取类型
收费全文 | 288篇 |
免费 | 104篇 |
国内免费 | 45篇 |
出版年
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 1篇 |
2017年 | 17篇 |
2016年 | 22篇 |
2015年 | 17篇 |
2014年 | 38篇 |
2013年 | 71篇 |
2012年 | 21篇 |
2011年 | 25篇 |
2010年 | 13篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 13篇 |
2006年 | 17篇 |
2005年 | 24篇 |
2004年 | 21篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2001年 | 14篇 |
2000年 | 10篇 |
1999年 | 14篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
排序方式: 共有437条查询结果,搜索用时 218 毫秒
71.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
72.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
73.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
74.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
75.
76.
"道尔-M1"防空导弹武器系统 总被引:3,自引:1,他引:2
介绍了俄罗斯“道尔 M1”防空导弹武器系统的功能、组成、特点和作战过程 ,并从武器系统的总体需求出发 ,介绍了其两部雷达所应用的主要技术。 相似文献
77.
分布孔径红外系统的研究现状及其展望 总被引:1,自引:0,他引:1
介绍了分布孔径红外系统 ( DAIRS)的基本概念与研制现状 ,讨论了DAIRS在先进战斗机及其它作战平台上的应用 ,并简略介绍了其中涉及的关键技术 ,对 DAIRS系统将来可能的发展趋势作了预测。 相似文献
78.
79.
80.
监视与侦察已成为现代C4ISR系统的重要组成部分,传统的监视与侦察系统效能分析方法存在模型难以建立、结果不准确等问题,很难量化其与作战效果之间的影响。在对基于Lanchester方程的C4ISR系统建模方法进行研究的基础上,提出了反映监视与侦察功能的Lanchester方程模型,并引入博弈论分析了战场上信息的不对称对交战结果的影响,克服了描述C4ISR系统的Lanchester方程没有考虑作战单元、对手和环境间的动态交互以及数学结构简单的缺点。仿真结果验证了模型的有效性。 相似文献